Implementing term rewriting by jungle evaluation
نویسندگان
چکیده
منابع مشابه
Implementing term rewriting by jungle evaluation
Jungles are acyclic hypergraphs which represent sets of terms such that common subterms can be shared. Term rewrite rules are translated into jungle evaluation rules which implement parallel term rewriting steps. By using additional hypergraph rules which “fold” equal subterms, even non-left-linear term rewriting systems can be implemented. As a side effect, these folding rules can speed up the...
متن کاملTerm Graph Rewriting 5 4 Adequacy of Graph Rewriting for Term Rewriting 8 5 Implementing Term Rewriting
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In earlier work, the authors have shown that for confluent TRSs, innermost polynomial runtime complexity induces polytime computability of the functions defined. In this paper, we generalise the above result to full rewriting. Following our...
متن کاملImplementing Term Rewriting by Graph Reduction: Termination of Combined Systems
It is well known that the disjoint union of terminating term rewriting systems does not yield a terminating system in general. We show that this undesirable phenomenon vanishes if one implements term rewriting by graph reduction: given two terminating term rewrite systems 7~o and 7~1, the graph reduction system implementing 7~0 -F T~1 is terminating. In fact, we prove the stronger result that t...
متن کاملAn Account of Implementing Applicative Term Rewriting
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation of two rewriters of the mCRL2 toolset. These rewriters work on open terms and use nonlinear match trees. A comparison is made with other commonly used efficient rewriters.
متن کاملTerm rewriting for normalization by evaluation
We extend normalization by evaluation rst presented in from the pure typed calculus to general higher type term rewriting systems We distinguish between computational rules and proper rewrite rules and de ne a domain theoretic model intended to explain why normalization by evaluation for the former is much more e cient Normalization by evaluation is proved to be correct w r t this model
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1991
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1991250504451